نتایج جستجو برای: diameter. girth
تعداد نتایج: 114593 فیلتر نتایج به سال:
let $r$ be a commutative ring with identity and $m$ an $r$-module. in this paper, we associate a graph to $m$, say ${gamma}({}_{r}m)$, such that when $m=r$, ${gamma}({}_{r}m)$ coincide with the zero-divisor graph of $r$. many well-known results by d.f. anderson and p.s. livingston have been generalized for ${gamma}({}_{r}m)$. we show that ${gamma}({}_{r}m)$ is connected with ${diam}({gamma}({}_...
let r be a fnite commutative ring and n(r) be the set of non unit elements of r. the non unit graph of r, denoted by gamma(r), is the graph obtained by setting all the elements of n(r) to be the vertices and defning distinct vertices x and y to be adjacent if and only if x - yin n(r). in this paper, the basic properties of gamma(r) are investigated and some characterization results regarding co...
In this paper, we deal with zero-divisor graphs of posets. We prove that the diameter of such a graph is either 1, 2 or 3 while its girth is either 3, 4 or ∞. We also characterize zero-divisor graphs of posets in terms of their diameter and girth. © 2012 Elsevier B.V. All rights reserved.
We prove that a connected graph of diameter at least 4 and of girth 7 or more (in particular, a tree) can be exactly reconstructed from metric balls of radius 2 of all its vertices. On the other hand, there exist graphs of diameter 3 and of girth 6 which are not reconstructible. This new graph theory problem is motivated by reconstruction of chemical compounds. © 2007 Published by Elsevier B.V.
If a nonsymmetric P-polynomial association scheme, or equivalently. a distanceregular digraph, has diameter d and girth g. then d = g or d = g 1, by Damerell’s theorem. The dual of this theorem was proved by Leonard. In this paper, we prove that the diameter of a nonsymmetric Pand Q-polynomial association scheme is one less than its girth and its cogirth. We also give a structure theorem for a ...
LDPC codes are serious contenders to Turbo codes in terms of decoding performance. One of the main problems is to give an explicit construction of such codes whose Tanner graphs have known girth. For a prime power q and m ≥ 2, Lazebnik and Ustimenko construct a q-regular bipartite graph D(m, q) on 2qm vertices, which has girth at least 2dm/2e+ 4. We regard these graphs as Tanner graphs of binar...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید